Fast almost-linear-sized nets for boxes in the plane

نویسندگان

  • Hervé Brönnimann
  • Jonathan Lenchner
چکیده

Let B be any set of n axis-aligned boxes in R, d ≥ 1. For any point p, we define the subset Bp of B as Bp = {B ∈ B : p ∈ B}. A box B in Bp is said to be stabbed by p. A subset N ⊆ B is a (1/c)-net for B if Np 6= ∅ for any p ∈ R such that |Bp| ≤ n/c. The number of distinct subsets Bp is O((2n)), so the set system described above has so-called finite VCdimension d. This ensures that there always exists (1/c)-nets of size O(dc log(dc)), and that they can be found in time Od(n)c, using quite general machinery (see for example the books by Matoušek [3] or by Pach and Agarwal [7]). For some set systems, such as halfplanes in R and translates of a simple closed polygon, it was shown that there exist (1/c)-nets of size O(c) [4]. This was extended to halfspaces in R and pseudo-disks in R [2]. In this paper, we investigate a fast, O(n log c)-time construction of (1/c)-nets of size O(c) for any value 1 < c ≤ n and d = 2. Until right before JCDCG, I thought I could prove the following (which unfortunately remains a conjecture):

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards Faster Linear-Sized Nets for Axis-Aligned Boxes in the Plane

Let B be any set of n axis-aligned boxes in R, d ≥ 1. We call a subset N ⊆ B a (1/c)-net for B if any p ∈ R contained in more than n/c boxes of B must be contained in a box of N , or equivalently if a point not contained in any box in N can only stab at most n/c boxes of B. General VC-dimension theory guarantees the existence of (1/c)-nets of size O(c log c) for any fixed d, the constant in the...

متن کامل

Geometric Hitting Sets for Disks: Theory and Practice

The geometric hitting set problem is one of the basic geometric combinatorial optimization problems: given a set P of points, and a set D of geometric objects in the plane, the goal is to compute a small-sized subset of P that hits all objects in D. In 1994, Bronniman and Goodrich [6] made an important connection of this problem to the size of fundamental combinatorial structures called -nets, ...

متن کامل

From Deduction Graphs to Proof Nets: Boxes and Sharing in the Graphical Presentation of Deductions

Deduction graphs [3] provide a formalism for natural deduction, where the deductions have the structure of acyclic directed graphs with boxes. The boxes are used to restrict the scope of local assumptions. Proof nets for multiplicative exponential linear logic (MELL) are also graphs with boxes, but in MELL the boxes have the purpose of controlling the modal operator !. In this paper we study th...

متن کامل

Linear Logic Without Boxes

Girard's original deenition of proof nets for linear logic involves boxes. The box is the unit for erasing and duplicating fragments of proof nets. It imposes synchronization, limits sharing, and impedes a completely local view of computation. Here we describe an implementation of proof nets without boxes. Proof nets are translated into graphs of the sort used in optimal calculus implementation...

متن کامل

Tighter Estimates for epsilon-nets for Disks

The geometric hitting set problem is one of the basic geometric combinatorial optimization problems: given a set P of points, and a set D of geometric objects in the plane, the goal is to compute a smallsized subset of P that hits all objects in D. In 1994, Bronniman and Goodrich [5] made an important connection of this problem to the size of fundamental combinatorial structures called -nets, s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004